Maximal σ-independent families

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal independent families and a topological consequence

For κ ω and X a set, a familyA⊆P(X) is said to be κ-independent on X if |⋂A∈F Af (A)| κ for each F ∈ [A]<ω and f ∈ {−1,+1}F ; here A+1 =A and A−1 =X\A. Theorem 3.6. For κ ω, some A ⊆ P(κ) with |A| = 2κ is simultaneously maximal κindependent and maximal ω-independent on κ . The family A may be chosen so that every two elements of κ are separated by 2κ -many elements of A. Corollary 5.4. For κ ω ...

متن کامل

Degrees of M-fuzzy families of independent L-fuzzy sets

The present paper studies fuzzy matroids in view of degree. First wegeneralize the notion of $(L,M)$-fuzzy independent structure byintroducing the degree of $M$-fuzzy family of independent $L$-fuzzysets with respect to a mapping from $L^X$ to $M$. Such kind ofdegrees is proved to satisfy some axioms similar to those satisfiedby $(L,M)$-fuzzy independent structure. ...

متن کامل

Residuality of Families of F σ Sets

We prove that two natural definitions of residuality of families of Fσ sets are equivalent. We make use of the Banach-Mazur game in the proof.

متن کامل

Model independent determination of the σ pole

The first part of this report reviews recent developments at the interface between lattice work on QCD with light dynamical quarks, effective field theory and low energy precision experiments. Then I discuss how dispersion theory can be used to analyze the low energy structure of the ππ scattering amplitude in a model independent manner. This leads to an exact formula for the mass and width of ...

متن کامل

Combinatorics of Unique Maximal Factorization Families (UMFFs)

Suppose a set W of strings contains exactly one rotation (cyclic shift) of every primitive string on some alphabet Σ. Then W is a circ-UMFF if and only if every word in Σ has a unique maximal factorization over W . The classic circ-UMFF is the set of Lyndon words based on lexicographic ordering (1958). Duval (1983) designed a linear sequential Lyndon factorization algorithm; a corresponding PRA...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fundamenta Mathematicae

سال: 1983

ISSN: 0016-2736,1730-6329

DOI: 10.4064/fm-117-1-75-80